Distributed timed automata
نویسنده
چکیده
In this article we discuss (i) a model suitable for describing a distributed real-time system and (ii) a notion of implementation for such systems on a uniprocessor system. The first point is addressed by amalgamating finite state automata with dense time (or Alur-Dill automata) and asynchronous distributed (or Zielonka) automata over a distributed alphabet. The second point is addressed by defining the process of interleaving and time slicing.
منابع مشابه
Timed Automata Templates for Distributed Embedded System Architectures
Networks of timed automata can be used to specify and verify distributed embedded systems. This technical report provides timed automata templates for a few basic components of such systems as a first step towards a library of reusable components which shall facilitate the design and analysis of large distributed embedded systems. In particular timed automata templates for common input event st...
متن کاملUsing Interval Petri Nets and Timed Automata for Diagnosis of Discrete Event Systems (DES)
A discrete event system (DES) is a dynamic system that evolves in accordance with the abrupt occurrence, at possibly unknown irregular intervals, of physical events. Because of the special nature of these systems, different tools are currently used for their analysis, design and modeling. The main focus of this paper is the presentation of a new modeling approach of Discrete Event Systems. The ...
متن کاملDistributed Time-Asynchronous Automata
We show that the class of distributed time-asynchronous automata is more expressive than timed automata, has a decidable emptiness problem, is closed under union, concatenation, star, shuffle and renaming, but not under intersection. The closure results are obtained by showing that distributed time-asynchronous automata are equivalent with a subclass of shuffle regular expressions and its relat...
متن کاملFault Diagnosis in Wireless Sensor Network using Timed Automata
An important problem in distributed systems that are subject to component failures is the distributed diagnosis problem. In distributed diagnosis, each working node must maintain correct information about the status (working or failed) of each component in the system. In this paper we consider the problem of identifying faulty (crashed) nodes in a wireless sensor network and used timed automata...
متن کاملParametric Deadlock-Freeness Checking Timed Automata
Distributed real-time systems are notoriously difficult to design, and must be verified, e. g., using model checking. In particular, deadlocks must be avoided as they either yield a system subject to potential blocking, or denote an ill-formed model. Timed automata are a powerful formalism to model and verify distributed systems with timing constraints. In this work, we investigate synthesis of...
متن کاملParametric, Probabilistic, Timed Resource Discovery System
This paper presents a fully distributed resource discovery and reservation system. Verification of such a system is important to ensure the execution of distributed applications on a set of resources in appropriate conditions. A semi-formal model for his system is presented using probabilistic timed automata. This model is timed, parametric and probabilistic, making it a challenge to the parame...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electr. Notes Theor. Comput. Sci.
دوره 28 شماره
صفحات -
تاریخ انتشار 1999